Solving weighted CSP by maintaining arc consistency

Recently, a general definition of arc consistency (AC) for soft constraint frameworks has been proposed [1]. In this paper we specialize this definition to weighted CSP and introduce two O(ed3) enforcing algorithms. Then, we refine the definition and introduce a stronger form of arc consistency (AC*) along with two O(n2d2 + ed3) algorithms. As in the CSP case, an important application of AC is to combine it with search. We empirically demonstrate that a branch and bound algorithm that maintains either AC or AC* is a state-of-the-art general solver for weighted CSP. Our experiments cover binary Max-CSP and Max-SAT problems.